Representing the automorphism group of an almost crystallographic group

THE AUTOMORPHISM GROUP OF FINITE GRAPHS

Let G = (V,E) be a simple graph with exactly n vertices and m edges. The aim of this paper is a new method for investigating nontriviality of the automorphism group of graphs. To do this, we prove that if |E| >=[(n - 1)2/2] then |Aut(G)|>1 and |Aut(G)| is even number.

The Automorphism Group of a Finite p-Group is Almost Always a p-Group

Many common finite p-groups admit automorphisms of order coprime to p, and when p is odd, it is reasonably difficult to find finite p-groups whose automorphism group is a p-group. Yet the goal of this paper is to prove that the automorphism group of a finite p-group is almost always a p-group. The asymptotics in our theorem involve fixing any two of the following parameters and letting the thir...

The Automorphism Group of a Homogeneous Almost Complex Manifold (*)

AUTOMORPHISM GROUP OF GROUPS OF ORDER pqr

H"{o}lder in 1893 characterized all groups of order $pqr$ where  $p>q>r$ are prime numbers. In this paper,  by using new presentations of these groups, we compute their full automorphism group.

THE AUTOMORPHISM GROUP OF NON-ABELIAN GROUP OF ORDER p^4

Let G be a finite non-abelian group of order p^4 . In this paper we give a structure theorem for the Sylow p-subgroup, Aut_p(G)  , of the automorphism group of G.